Flexible segmentation scheme for communication systems

ABSTRACT

Methods, computer program products, electronic devices and information blocks are provided that improve both efficiency of transmission and efficiency of segmentation by enabling an intelligent transport block size determination and a flexible segmentation scheme suitable for utilization with retransmission. One exemplary method involves steps of: determining a size of a transport block based on criteria including a size of at least one data block to be transmitted, wherein the transport block size is determined such that the transport block will include at least one segment of a data block of the at least one data block; segmenting the data block of the at least one data block into a plurality of segments including the at least one segment; and populating the transport block with at least the at least one segment.

CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application claims priority under 35 U.S.C. §119(e) fromProvisional Patent Application No. 60/756,919, filed Jan. 5, 2006, thedisclosure of which is incorporated by reference herein in its entirety.

TECHNICAL FIELD

The exemplary and non-limiting embodiments of this invention relategenerally to wireless communication systems and, more specifically,relate to segmentation schemes.

BACKGROUND

The following abbreviations are herewith defined:

3G Third Generation Mobile Network

AR access router

ARQ automatic repeat request

BS base station (also referred to as a Node B)

E-UTRAN Evolved Universal Terrestrial Radio Access Network

HSDPA High Speed Downlink Packet Access

IP internet protocol

L1 Layer 1 (Physical Layer)

L2 Layer 2 (MAC Layer)

LCID logical channel identity

MAC Medium Access Control Layer (L2)

PHY Physical Layer (L1)

PDU protocol data unit

QoS quality of service

RNC radio network controller

SDU service data unit

SSN service data unit (SDU) sequence number

TB transport block

TCP transmission control protocol

UDP user datagram protocol

UE user equipment

UL uplink

UTRAN Universal Terrestrial Radio Access Network

VoIP voice over internet protocol

WCDMA Wide-Band Code-Division Multiple Access

WLAN wireless local area network

In E-UTRAN, application flows with different QoS requirements are servedover the wireless path by different logical channels in the MAC protocollayer. MAC SDUs, which are higher layer packets such as IP packets, arequeued in priority queues, which are arranged for the logical channels.The amount of data to be transmitted for each logical channel isdetermined for every radio frame transmission, attempting to meet theQoS requirements of each IP traffic flow. Then, for each UE, MACmultiplexes (concatenates) the scheduled data from the priority queuesinto one TB. In this process, MAC may need to segment MAC SDUs to makethem fit into the TB. After triggering TBs from MAC, PHY multiplexes TBsfrom different LJEs into a radio frame.

In prior art cellular systems (e.g., 3G), the SDUs are segmented andconcatenated to constant size PDUs, which are defined per transportchannel. This adds segmentation and multiplexing overhead. The reasoningis that the transmission capacity of a radio link varies in time andsmall payloads are often available. Thus the constant size PDU typicallyneeds to be small. A small PDU fits well with the small rate channels,but will cause a lot of overhead when segmenting large SDUs into thesmall PDUs. On the other hand, many small PDUs need to be created forthe high rate channels, which will cause multiplexing overhead.Optimally, the PDU size would be modified depending on the capabilitiesof the transport channel and its temporary conditions. However,modification of the PDU size, in 3G, requires a heavy peer-to-peerprocedure and re-segmentation. Hence, it is typically not preferred.

In prior art wireless systems (e.g., WLAN), SDUs are transmitted as fullpackets. The multiple access is based on random access/collisiondetection in uplink and scheduling in downlink. Thus, once atransmission resource is indicated for a given user, it is allowed touse the full bandwidth for a short period of time as required for thetransmission of the entire SDU available. In such a manner, there isless segmentation and multiplexing overhead. However, large expectedmulti-user multiplexing gains will not be available.

The problems of these prior art segmentation schemes are even moreevident in newer cellular and wireless systems, where the availablebandwidth is large, bandwidth flexibility is large and the symbol rateis high, but varying radio conditions impose receiver-dependent andtime/frequency-dependent characteristics on the transmission of eachradio link. On the other hand, for any receiver, gains available byfrequency scheduling, gains available by exploiting the frequencydiversity present in the channel and gains available by adaptivetransmission bandwidth selection are significant. Yet, multi-user gains,which are realized by allocating independent radio links efficiently intime and frequency are significant as well. Thus, the segmentationscheme should be flexible and efficient to allow usage of any of thesekinds of transmission techniques. Neither of the mentioned prior artschemes, i.e. a fixed PDU size and a trivial segmentation scheme, canefficiently meet these contradictory requirements. In such conditions,full SDU transmissions are feasible and generally preferred for lowoverhead. However, segmentation may still be necessary for large SDUs tobe received on difficult low bit-rate radio links.

In conventional segmentation approaches for WCDMA and HSDPA,segmentation is performed before a TB size is decided. Hence, the systemcan only deliver fixed size or at least ready-made segments and thus hasto concatenate segments to fill the TB efficiently. This increases theamount of headers and complicates the procedure by trying to matchsegments to the tail of the TB.

In another prior art segmentation scheme, SDU retransmissions using theSSN is employed. However, full SDU retransmission is generallyinefficient and may lead to problems in low bit-rate radio linkconditions. The efficiency also depends on the traffic class and thesize distribution of data. If the application generates large TCP/UDPsegments in the IP packets and the system bandwidth is narrow, one SDUmust be segmented into many small segments. For example, the maximumtransmission unit (MTU) or maximum segment size (MSS) for an IP packetover Ethernet is typically 1500 bytes, and one sub-frame over a 1.25 MHzsystem with ½-coding rate and Quadrature Phase Shift Keying (QPSK)modulation only has about 450 information bits. This means that, forthis system, one SDU will be segmented into 28 segments, thus increasingthe probability of SDU error. A large SDU in such a system would likelybe re-transmitted one or more times. Not only will the throughput of theradio link be significantly reduced but, in addition, the cellthroughput will be reduced since retransmissions are typicallyprioritized.

SUMMARY

In an exemplary aspect of the invention, a method is provided. Themethod includes: determining a size of a transport block based oncriteria including a size of at least one data block to be transmitted,wherein the transport block size is determined such that the transportblock will include at least one segment of a data block of the at leastone data block; segmenting the data block of the at least one data blockinto a plurality of segments including the at least one segment; andpopulating the transport block with at least the at least one segment.

In another exemplary aspect of the invention, a computer program productis provided. The computer program product includes program instructionsembodied on a tangible computer-readable medium. Execution of theprogram instructions results in operations including: determining a sizeof a transport block based on criteria including a size of at least onedata block to be transmitted, wherein the transport block size isdetermined such that the transport block will include at least onesegment of a data block of the at least one data block; segmenting thedata block of the at least one data block into a plurality of segmentsincluding the at least one segment; and populating the transport blockwith at least the at least one segment.

In a further exemplary aspect of the invention, another method isprovided. The method includes: segmenting a data block into a pluralityof segments, wherein each segment of the plurality of segments has adata block identifier, a length value and an offset value, wherein thedata block identifier has an identification of the segmented data block,wherein the length value has the length of the segment, wherein theoffset value has the boundary of the segment as compared to thesegmented data block, wherein the segmented data block is to betransported by a plurality of transport blocks; populating a transportblock of the plurality of transport blocks with at least one segment ofthe plurality of segments; and in response to receiving a retransmissionnotice indicating a segment of the plurality of segments, retransmittingthe indicated segment, wherein the retransmission notice includes thedata block identifier, the length value and the offset value of theindicated segment.

In another exemplary a computer program product is provided. Thecomputer program product includes program instructions embodied on atangible computer-readable medium. Execution of the program instructionsresults in operations including: segmenting a data block into aplurality of segments, wherein each segment of the plurality of segmentshas a data block identifier, a length value and an offset value, whereinthe data block identifier has an identification of the segmented datablock, wherein the length value has the length of the segment, whereinthe offset value has the boundary of the segment as compared to thesegmented data block, wherein the segmented data block is to betransported by a plurality of transport blocks; populating a transportblock of the plurality of transport blocks with at least one segment ofthe plurality of segments; and in response to receiving a retransmissionnotice indicating a segment of the plurality of segments, retransmittingthe indicated segment, wherein the retransmission notice includes thedata block identifier, the length value and the offset value of theindicated segment.

In a further exemplary aspect of the invention, an electronic device isprovided. The electronic device includes: a memory configured to storeat least one data block to be transmitted by a transport block; and adata processor coupled to the memory, wherein the data processor isconfigured to perform operations including: determining a size of thetransport block based on criteria including a size of a data block ofthe at least one data block, wherein the transport block size isdetermined such that the transport block will include at least onesegment of the data block; segmenting the data block into a plurality ofsegments including the at least one segment; and populating thetransport block with at least the at least one segment and the at leastone full data block.

In another exemplary aspect of the invention, an information block isprovided. The information block is to be transmitted from a first nodeto a second node and is stored on a tangible computer-readable mediumprior to transmission. The information block includes: a portion of adata block, wherein the portion of the data block does not include thecomplete data block; a data block identifier having an identification ofthe data block; a length value having a size of the portion of the datablock; and an offset value having a boundary of the portion of the datablock as compared to the complete data block.

In a further exemplary aspect of the invention, an electronic device isprovided. The electronic device includes: a data processor; and atransmitter coupled to the data processor. The transmitter is configuredto transmit a retransmission notice indicating a segment of a pluralityof segments. The retransmission notice includes a request forretransmission of the indicated segment. The plurality of segmentsinclude a segmented data block. The retransmission notice has a datablock identifier, a length value and an offset value of the indicatedsegment. The data block identifier has an identification of thesegmented data block. The length value has a length of the indicatedsegment. The offset value has a boundary of the indicated segment ascompared to the segmented data block.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other aspects of embodiments of this invention aremade more evident in the following Detailed Description, when read inconjunction with the attached Drawing Figures, wherein:

FIG. 1A shows a simplified block diagram of various electronic devices,as connected to a wireless network, that are suitable for use inpracticing the exemplary embodiments of this invention;

FIG. 1B shows a simplified block diagram of various electronic devices,as connected to a base station that is itself connected to a networkwith one or more access routers, that are suitable for use in practicingthe exemplary embodiments of this invention;

FIG. 2 illustrates an exemplary segment structure of a segment asemployed by exemplary embodiments of this invention;

FIG. 3 depicts the data flow for practicing an exemplary embodiment ofthis invention;

FIG. 4 shows a detailed message signalling chart for downlink datatransmission procedures of an exemplary embodiment of this invention;

FIG. 5 shows a detailed message signalling chart for uplink datatransmission procedures of an exemplary embodiment of this invention;

FIG. 6 illustrates a detailed message signaling chart for uplink datatransmission procedures of an exemplary embodiment of this invention ina longer time scale than FIG. 5;

FIG. 7 illustrates a detailed message signaling chart for uplink datatransmission procedures of another exemplary embodiment of thisinvention in a longer time scale than FIG. 5;

FIG. 8 represents an exemplary embodiment of the invention with a vectordelivery arranged per logical channel;

FIG. 9 shows a message sequence chart for an exemplary embodiment of theinvention using the LCIDs and SDUs of FIG. 8;

FIG. 10 illustrates an exemplary embodiment of the invention wherein aSDU is segmented based on a determined TB size;

FIG. 11 illustrates a further implementation of the exemplary embodimentof FIG. 10 wherein the SDU is further segmented based on anotherdetermined TB size;

FIG. 12 depicts a flowchart illustrating one non-limiting example of amethod for practicing the exemplary embodiments of this invention; and

FIG. 13 depicts a flowchart illustrating another non-limiting example ofa method for practicing the exemplary embodiments of this invention.

DETAILED DESCRIPTION

Exemplary embodiments of the invention improve both the efficiency ofthe transmission and the efficiency of the segmentation by providing anintelligent TB size determination method and a flexible segmentationscheme for retransmission. The description focuses on downlinktransmission and is primarily for the BSs, although these serve asnon-limiting exemplary embodiments of the invention. Additionalnon-limiting exemplary embodiments of the invention include respectiveapplications of the method to a UE and UL transmission. In the downlinktransmission exemplary, the receiver functionality is in the UE. In theuplink transmission exemplary, the receiver functionality is in the BS.Note that this invention can be applied to any protocol layer that hassegmentation and retransmission functionalities. As a non-limitingexample, it may be applied to the L1/L2 interface for E-UTRAN.

Reference is made first to FIG. 1A for illustrating a simplified blockdiagram of various electronic devices that are suitable for use inpracticing the exemplary embodiments of this invention. In FIG. 1A, awireless network 1 is adapted for communication with a UE 10 via a NodeB (base station) 12. The network 1 may include a RNC 14, which may bereferred to as a serving RNC (SRNC). The UE 10 includes a data processor(DP) 10A, a memory (MEM) 10B that stores a program (PROG) 10C, and asuitable RF transceiver 10D (having a transmitter (TX) and a receiver(RX)) for bidirectional wireless communications with the Node B 12,which also includes a DP 12A, a MEM 12B that stores a PROG 12C, and asuitable RF transceiver 12D. The Node B 12 is coupled via a data path 13(lub) to the RNC 14 that also includes a DP 14A and a MEM 14B storing anassociated PROG 14C. The RNC 14 may be coupled to another RNC (notshown) by another data path 15 (Iur). At least one of the PROGs 10C, 12Cand 14C is assumed to include program instructions that, when executedby the associated DP, enable the electronic device to operate inaccordance with the exemplary embodiments of this invention, as will bediscussed below in greater detail.

FIG. 1B shows a simplified block diagram of various electronic devicesthat are suitable for use in practicing the exemplary embodiments ofthis invention. As in FIG. 1A, FIG. 1B depicts a wireless networkadapted for communication with a UE 10 via a Node B (base station) 12.The UE 10 includes a data processor (DP) 10A, a memory (MEM) 10B thatstores a program (PROG) 10C, and a suitable RF transceiver 10D (having atransmitter (TX) and a receiver (RX)) for bidirectional wirelesscommunications with the Node B 12, which also includes a DP 12A, a MEM12B that stores a PROG 12C, and a suitable RF transceiver 12D. The NodeB 12 is coupled via a data path 16 to a network 17. The network 17contains one or more access routers (AR) 17A, 17B, and 17C to facilitatethe connection with Node B 12. At least one of the PROGs 10C and 12C isassumed to include program instructions that, when executed by theassociated DP, enable the electronic device to operate in accordancewith the exemplary embodiments of this invention, as will be discussedbelow in greater detail.

In general, the various embodiments of the UE 10 can include, but arenot limited to, cellular phones, personal digital assistants (PDAs)having wireless communication capabilities, portable computers havingwireless communication capabilities, image capture devices such asdigital cameras having wireless communication capabilities, gamingdevices having wireless communication capabilities, music storage andplayback appliances having wireless communication capabilities, Internetappliances permitting wireless Internet access and browsing, as well asportable units or terminals that incorporate combinations of suchfunctions.

The embodiments of this invention may be implemented by computersoftware executable by the DP 10A of the UE 10 and other DPs such as theDP 12A, or by hardware, or by a combination of software and hardware.

The MEMs 10B, 12B and 14B may be of any type suitable to the localtechnical environment and may be implemented using any suitable datastorage technology, such as semiconductor-based memory devices, magneticmemory devices and systems, optical memory devices and systems, fixedmemory and removable memory. The DPs 10A, 12A and 14A may be of any typesuitable to the local technical environment, and may include one or moreof general purpose computers, special purpose computers,microprocessors, digital signal processors (DSPs), processors based on amulti-core processor architecture, and Application Specific IntegratedCircuits (ASICs), as non-limiting examples.

Exemplary embodiments of this invention provide a TB size determinationmethod that takes the SDU boundaries into account, and a flexiblesegmentation scheme that allows flexible segment retransmission.According to exemplary embodiments of the invention, TB size isdetermined taking the SDU boundaries into account and segmentation isperformed after the TB size has been determined. Given a TB size and SDUboundaries, the MAC segments MAC SDUs to fit them into the TB byconsidering the MAC SDU boundary. For example, if the MAC SDU is verysmall, such as for a VoIP packet, the MAC does not segment the SDU atall. Another non-limiting example of a small MAC SDU is a TCPacknowledgement. In addition, if the remaining part of the SDU is verysmall, further segmentation is avoided, if possible. As many full,non-segmented SDUs as possible are delivered by each TB. In theremainder of the TB, that is, the portion that cannot be filled bycomplete SDUs, a sequence of bytes (variable length segments of SDUs) isinserted to fill the TB. Note that the headers, as overhead of thepayload, may be subtracted from the variable length SDU size filling theTB exactly.

In relation to the retransmission technique, exemplary embodiments ofthis invention provide a segment structure using offset and lengthfields. “Offset” and “length” refer to the starting position of thesegment in the original SDU and the length of the segment (e.g., in byteresolution), respectively. The receiver is configured to maintain areceiver window for the full SDUs by having an offset and lengthsignaled for the segments of partially transmitted SDUs. The receiverwindow indicates which SDUs are missing, which SDUs have been fullyreceived, which SDUs have been partially received, and which part(s) ofthe SDUs are missing. The partially received SDUs may have one orseveral segments missing. However, once a later segment is correctlyreceived, the receiver is enabled to track between which offsets it hasmissing data. In fact, the receiver does not need to know whether thetransmitter originally tried to deliver the missing part in one or moresegments. When generating an ARQ status report, the receiver calculatesthe missing data between the received offsets for any partially receivedSDU. Thus, the retransmission request is indicative of a portion from(offset (early)+length) to offset (late), which is announced as aretransmission request; offset=offset (early+length) and length=offset(late)−(offset (early)+length). After the transmitter receives an ARQstatus report or negative-acknowledgements (NACKs), it retransmitsmissing data for the requested missing full SDUs and for the requestedpartially missing SDUs. The transmitter may decide to retransmit thefull SDU or only the missing segments. Employing the invention'ssegmentation scheme, the retransmission of missing segments is not boundto the original segment sizes and the transmitter may append them to theTB transmission either in larger numbers of smaller segments or insmaller numbers of larger segments, as compared to the originaltransmission. This choice may also depend on the TB size, which isdetermined at the time based on frame scheduling (multi-user scheduling)and logical channel priorities.

As a non-limiting example, one approach that may be utilized inconjunction with the exemplary embodiments of the invention comprisesusing the segment sequence number to indicate re-numbering of thesegments (i.e., the offset value). Generally, using the segment sequencenumber for retransmission requests independently of aspects of theexemplary embodiments of the invention is not preferred as the segmentsize may change depending on radio link conditions and theirretransmission by segment sequence number would require re-segmentationand re-numbering. However in this case, the segment sequence number (ofthe re-segmented segment having a re-numbered segment sequence number)may be employed in conjunction with aspects of the exemplary embodimentsof the invention, for example, by using the segment sequence number asthe offset value comprising a boundary of the indicated segment.

For a large SDU requiring retransmission, the transmitter may simplysegment the missing parts of the large SDU and attempt to deliver themagain, potentially as a sequence of smaller segments. (Note thatre-segmentation is not necessary as the non-segmented full SDUs residein the priority queues contrary to the prior art.) Such smaller segmentswould consume marginal capacity from the sub-frame and cell throughputwould be maintained by the other served radio links, even if thethroughput of that specific radio link appears to drop. Further, it ispossible to apply more robust transport formats (low order modulation,low rate channel code, increased diversity mode) to the smaller segmentsas compared to the transport format selection for larger segments orfull SDUs. Note that a retransmission without adapting to smallersegments or a more robust transport format is also feasible and iswithin the scope of the exemplary embodiments of this invention.

When determining the TB size for each radio link (UE) at a givensub-frame instance, SDU boundaries should be taken into account inaddition to other factors such as the expected channel conditions of theradio links, the amount of data to be transmitted from each of thepriority queues of the logical channels and the priority of the UEs, asnon-limiting examples. The amount of data to be transmitted may be anyquantity from the minimum guaranteed data to all available data in thequeues. This becomes feasible due to the great degree of freedom thatthe scheduler and allocation functions have, either to schedule fewerUEs per sub-frame with larger payloads less frequently or to schedulemore UEs per sub-frame with smaller payloads more frequently. Thesechoices lead to different gain factors of transmission and differentamounts of segmentation and multiplexing overhead.

In exemplary embodiments of the invention, two methods, hereinidentified as (A) and (B), may be employed when requesting datatransmission.

(A) The amount of data to be transmitted for each traffic flow (priorityqueue) and the MAC SDU boundaries closest to these values are provided.Then, the TB size allocated for each UE is determined by utilizing allavailable information so that the block size contains SDUs with minimumor no segmentation.

(B) The amount of data to be transmitted from each traffic flow(priority queue), herein referred to as the SDU-aligned data amount, iscalculated based on the scheduling decision and is aligned to the SDUboundaries as much as possible. When requesting data transmission, theSDU-aligned data amount is provided.

Using either method, given the information, the block size is determinedso that segmentation is avoided as much as possible. However, this ismerely a guideline and the block size or requested data size need notalways be aligned to the SDU boundaries if, for example, the discrepancyis large.

For method (A) above, a vector comprising the minimum amount of data tobe transmitted and MAC SDU boundaries closest to the minimum amount (theelements of which correspond to traffic flows) are provided using theinterface. Other parameters, such as priority, may also be providedusing the interface.

For method (B) above, a vector of SDU-aligned data amounts (the elementsof which correspond to traffic flows) are provided. Other parameters,such as priority, may also be provided using the interface.

Given a TB size, segmentation is performed, when necessary, for packingSDUs into the TB. Each segment comprises the SDU sequence number,length, and partial SDUs, wherein the partial SDUs additionally includethe segment offset inside a full SDU. As noted above, “offset” indicatesthe starting position of the segment in the original SDU and “length”indicates the length of the segment, which may be in byte resolution.

FIG. 2 illustrates an exemplary segment structure of a segment 20.Segment 20 contains a segment header 21 and a payload 26. The segmentheader 21 comprises the SDU sequence number (SSN) 22, the length valueof the segment 23, the offset value 24 (optional), and other fields inthe segment header (OF) 25, if necessary. Payload 26 containsinformation from the SDU.

When retransmission is necessary, the receiver may request theretransmission of a missing SDU by indicating the SSN. The receiver mayrequest the retransmission of a missing part of a SDU by indicating theSSN, offset and length of the missing part. These retransmissionrequests are signalled in an ARQ status report. When retransmission isrequested and the given, new TB size cannot accommodate the originalsegment size, the transmitter may perform segmentation, to any size, byusing the length and offset fields.

FIG. 3 depicts the data flow. Starting from logical channel queues 30,34, MAC SDUs are segmented if necessary 31, 35, and multiplexed(concatenated) 32, 36 into a transport block 33, 37 for each UE. Then,TBs 33, 37 are multiplexed 38 into a physical radio frame 40, sent outthrough L1 39. As illustrated in the figure for TB-n 37, TBs 33, 37comprise a header with a combination of one or more SDUs, noted in thefigure as SDU1 and SDU2, and/or a segment. Radio frame 40 comprises aheader with one or more multiplexed TBs, indicated in the figure by TB-1and TB-n.

FIGS. 4 and 5 illustrate detailed message signalling charts for downlinkand uplink data transmission procedures, respectively. Depending on thescheduling (e.g., at the MAC layer), the amount of data to betransmitted for each logical channel of each UE is determined. Then, theMAC provides vector information for the data amount (which can be eitheroption (A) or (B) as noted above), each element of which corresponds toeach logical channel. In this vector information, the SDU boundaries aretaken into account. Then, the allocation unit (e.g., at PHY) determinesthe TB size by using the given information comprising the data amountand radio link conditions, among other factors, and returns the TB sizeinformation to the MAC layer for each of the active radio links. Giventhe TB size, MAC starts segmentation by taking the SDU boundaries intoaccount. The segment structure can be as shown in FIG. 2. Theretransmission (at the MAC layer) can use flexible segment sizeaccording to the invention.

For the above signalling procedure, the primitives are defined asfollows in Table 1. TABLE 1 Parameters Generic Name Request IndicationResponse Confirm PHY_BS_DL_Schedule Radio link Radio ID, link ID, Vectorof TB size {minimum data size, SPI} available data size,PHY_BS_UL_Schedule Radio link ID, Vector of {minimum data size, SPI}available data size, PHY_UE_UL_Schedule TB size

FIGS. 6 and 7 illustrate two different candidate message signallingcharts for uplink data transmission procedures, shown in a longer timescale than FIG. 5. In order to realize the uplink packet scheduling inBS as shown in FIG. 5, UE informs the BS of the uplink data amount to bescheduled in the next uplink scheduling period. In these candidateexamples, the uplink scheduling period is set to be several radioframes. For this uplink data indication from UE to BS, RRC message(e.g., a Capacity Request Message) and MAC control PDU (e.g., an UplinkBuffer Status Report) are used in FIGS. 6 and 7, respectively. Eitherone of these may be used in exemplary embodiments of this invention.

An overview of the flexible segmentation method, including theretransmissions, is shown in FIG. 8. This figure shows the inventionwith a vector delivery arranged per logical channel. “KSx,y” and “LSx,y”denote the y-th segment of the K-th logical channel of SDU number x andthe y-th segment of the L-th logical channel of SDU number x,respectively. For different logical channels K and L, the SDU boundariesare taken into account. For the retransmission, the use of offset andlength enables fully flexible segment sizes. The method employed favorstransmission of complete SDUs, but it further allows for thesegmentation of SDUs into any byte aligned size, which is decided at thetransmission instant. Thus, for any retransmission, the segment size maybe freely changed. Included is an ARQ status report, which, in additionto a full SDU error bitmap, may announce the offset and length of themissing segments of partially received SDUS.

In FIG. 8, five TBs are depicted, numbered 1 through 5 (i.e., TB₁through TB₅). Of the five TBs, TB₂ and TB₃ are not received. Hence,LS1,2 and LS1,3 (also referred to as LS1,23) are retransmitted in TB₅ inaccordance with the exemplary embodiments of this invention.

FIG. 9 is a message sequence chart based on the LCIDS, SDUs and TBs ofFIG. 8. Transmitter (TX) and receiver (RX) windows are shown with theirrespective contents as the transmissions progress. In accordance withexemplary embodiments of the invention, the receiver initially fails toreceive partial SDUs LS1,2 and LS1,3 which are subsequentlyretransmitted in TB₅ as LS1,23. As stated above, the request forretransmission of SDUs LS1,23 may comprise an ARQ status report or aNACK, as non-limiting examples.

FIG. 10 illustrates an exemplary embodiment of the invention wherein aSDU is segmented based on a determined TB size. In FIG. 10(A), threeSDUs are shown, SDU₀ 62, SDU₁ 64 and SDU₂ 66, with each having a lengthL₀, L₁ and L₂, respectively. As indicated, L₀=100 bytes, L₁=400 bytesand L₂=300 bytes. The three SDUs 62, 64, 66 of FIG. 10(A) are to betransmitted.

In FIG. 10(B), the length (L_(TB1)) of a TB₁ 68 is determined based oncriteria including the sizes L₀, L₁, L₂ of the SDUs 62, 64, 66. As anon-limiting example of this process, consider the following. It isdesirable to transmit at least one complete SDU. Thus, the TB sizepreferably should be no less than 100 bytes (i.e., the TB preferablyshould be able to hold at least the smallest SDU, SDU₀ 62). However, dueto scheduling and logical channel priorities, this communication linkand SDUs, for this particular time and formation of a TB, has beenallocated 200 bytes (TB₁ length L_(TB1)=200 bytes). Although shown inFIG. 10(B) for illustrative purposes, the TB, 68 has not actually beencreated (e.g., populated) yet.

Since it is desirable to transmit complete SDUs when possible, the TB,68 will comprise SDU₀ 62. Thus, 100 bytes-worth of length remains to befilled, possibly by one or more segments of other SDUs, SDU₁ 64 and/orSDU₂ 66.

In FIG. 10(C), based on the above-stated preference of transmitting atleast one complete SDU and further based on the determined TB₁ lengthL_(TB1), an SDU, here SDU₁ 64, is segmented into a plurality ofsegments, segment 1-1 (S₁₋₁) 70 and segment 1-R (S_(1-R)) 72, eachhaving a respective length of 100 bytes (L₁₋₁) and 300 bytes (L_(1-R)).The SDU₁ 64 is purposefully segmented to produce S₁₋₁ 70 having a lengthL₁₋₁ of 100 bytes such that S₁₋₁ 70 is of a suitably size to fill anavailable portion of the TB₁ 68, the available portion being theremaining portion of the TB₁ 68 after it has been populated with theSDU₀ 62. The remaining portion of the SDU₁ 64, namely the S_(1-R) 72,can be transmitted, in whole or in part, in another TB. (See FIG. 11 anddiscussion thereof below.)

In FIG. 10(D), the TB₁ 68 is populated with the SDU₀ 62 and the S₁₋₁ 70.The TB₁ 68 may then be transmitted using the method and componentsdiscussed above in FIG. 3, as a non-limiting example.

As is apparent, the size L_(TB1) of the TB₁ 68 is suitably determined byconsidering the lengths L₀, L₁, L₂ of the SDUs 62, 64, 66. Furthermore,the allocated size (200 bytes) of the TB₁ 68 is used efficiently byenabling the segmentation of an SDU (i.e., SDU₁ 64).

FIG. 11 illustrates a further implementation of the exemplary embodimentof FIG. 10 wherein the SDU₁ 64 is further segmented based on anotherdetermined TB size. In FIG. 11, a second TB (TB₂) 78 is configured andpopulated using the remaining SDUs 64, 66 or portions thereof from FIG.10(A). The TB₂ 78 is subsequent to the transmission of the TB₁ 68discussed in FIG. 10.

In FIG. 11(A), the length (L_(TB2)) of the TB₂ 78 is determined based oncriteria including the sizes L_(1-R), L₂ of the SDUs (or partial SDUS,i.e., segments) S_(1-R) 72 and SDU₂ 66 that remain to be transmitted. Asa further non-limiting example of this process, consider the following.It is desirable to transmit at least one complete SDU if any remain.Thus, the TB size preferably should be no less than 300 bytes (i.e., theTB preferably should be able to hold at least the smallest remainingSDU, SDU₂ 66). Due to scheduling and logical channel priorities havingchanged since the configuration and population of the first TB, TB₁ 68,this communication link and data, for this particular time and formationof a TB, has been allocated 500 bytes (TB₂ length L_(TB2)=500 bytes).Although shown in FIG. 11(A) for illustrative purposes, the TB₂ 78 hasnot actually been created (e.g., populated) yet.

Since it is desirable to transmit complete SDUs when possible, the TB₂78 will comprise SDU₂ 66. Thus, 200 bytes-worth of length remains to befilled, possibly by one or more segments of other SDUs (e.g., a segmentof S_(1-R) 72).

In FIG. 11(B), based on the above-stated preference of transmitting atleast one complete SDU and further based on the determined TB₂ lengthL_(TB2), a remaining portion of the SDU₁, S_(1-R) 72, is re-segmentedinto a plurality of segments, segment 1-23 (S₁₋₂₃) 80 and segment 1-4(S₁₋₄) 82, each having a respective length of 200 bytes (L₁₋₂₃) and 100bytes (L₁₋₄). The remainder of the SDU₁ 64, S_(1-R) 72, is purposefullysegmented to produce S₁₋₂₃ 80 having a length L₁₋₂₃ of 200 bytes suchthat S₁₋₂₃ 80 is of a suitable size to fill an available portion of theTB₂ 78, the available portion being the remaining portion of the TB₂ 78after it has been populated with the SDU₂ 66. The remaining portion ofthe SDU₁ 64 that has not been allocated to a TB, namely the S₁₋₄ 82, canbe transmitted, in whole or in part, in another TB.

In FIG. 11(C), the TB₂ 78 is populated with the SDU₂ 66 and the S₁₋₂₃80. The TB₂ 78 may then be transmitted using the method and componentsdiscussed above in FIG. 3, as a non-limiting example.

As is apparent, the size L_(TB2) of the TB₂ 78 is suitably determined byconsidering the lengths L_(1-R) and L₂ of the remaining portions of SDUs(S_(1-R) 72) and SDUs (SDU₂ 66). Furthermore, the allocated size (500bytes) of the TB₂ 78 is used efficiently by enabling the furthersegmentation of a remaining portion of an SDU (i.e., the remainingportion of SDU₁ 64, the S_(1-R) 72).

Although the exemplary SDUs and TBs of FIGS. 10 and 11 are describedwith respect to their respective lengths, any suitable size indicationmay be used. Furthermore, any suitable measurement scale and/or unit maybe employed. Although the TBs of FIGS. 10 and 11 are shown as comprisingonly SDUs or portions thereof, TBs usually comprise additional, non-SDUportions, such as portions employed for signaling or identificationpurposes, as non-limiting examples.

The exemplary embodiments described in FIGS. 10 and 11 may also beutilized in conjunction with retransmission, should retransmission benecessary. Each transmitted segment would include a SSN, a length and anoffset. If it were indicated that a segment should be retransmitted, thesegment would be identifiable by its SSN, length and offset. In such amanner, only that specific portion of the SDU (i.e., the portion thatcomprises the identified segment) would have to be retransmitted. Insuch a manner, full retransmission of a complete SDU is unnecessaryunless a TB was populated with the complete SDU in question.

A further non-limiting example of an exemplary electronic devicesuitable for use in conjunction with aspects of the exemplaryembodiments of the invention is provided. The electronic devicecomprises: a data processor; and a transmitter coupled to the dataprocessor. The transmitter is configured to transmit a retransmissionnotice indicating a segment of a plurality of segments. Theretransmission notice comprises a request for retransmission of theindicated segment. The plurality of segments comprise a segmented datablock. The retransmission notice comprises a data block identifier, alength value and an offset value of the indicated segment. The datablock identifier comprises an identification of the segmented datablock. The length value comprises a length of the indicated segment. Theoffset value comprises a boundary of the indicated segment as comparedto the segmented data block. In other embodiments, the electronic devicefurther comprises: a receiver coupled to the data processor. In furtherembodiments the electronic device comprises a mobile terminal. In otherembodiments, the electronic device comprises a base station in anEvolved Universal Terrestrial Radio Access Network (E-UTRAN) system. Infurther embodiments, the electronic device may comprise any other aspector component of the exemplary embodiments of the invention as describedherein.

FIG. 12 depicts a flowchart illustrating one non-limiting example of amethod for practicing the exemplary embodiments of this invention. Themethod includes the following steps. In box 101, a size of a transportblock is determined based on criteria. The criteria comprises a size ofat least one data block to be transmitted. The transport block size isdetermined such that the transport block will include at least onesegment of a data block of the at least one data block. In box 102, thedata block of the at least one data block is segmented into a pluralityof segments comprising the at least one segment. In box 103, thetransport block is populated with at least the at least one segment.

In other embodiments, the method further comprises transmitting thepopulated transport block. In further embodiments, the criteria furthercomprises multi-user scheduling and/or logical channel priorities. Inother embodiments, the criteria further comprises at least one of:expected channel conditions of a plurality of radio links, an amount ofdata to be transmitted from each priority queue and a priority value ofeach terminal that is assigned a logical channel. In furtherembodiments, each segment of the plurality of segments comprises a datablock identifier, a length value and an offset value, wherein the datablock identifier comprises an identification of the segmented datablock, wherein the length value comprises a length of the segment,wherein the offset value comprises a boundary of the segment as comparedto the segmented data block.

In other embodiments, the method further comprises: in response toreceiving a retransmission notice indicating a segment of the pluralityof segments, retransmitting the segment, wherein the retransmissionnotice comprises the data block identifier, the length value and theoffset value of the indicated segment. In further embodiments,determining the transport block size comprises calculating an amount ofdata to be transmitted for each priority queue based on a schedulingdecision, wherein the retransmission notice comprises the amount of datato be transmitted for each priority queue.

In other embodiments, determining the transport block size comprisesproviding an amount of data to be transmitted for each priority queueand a size of at least one close data block, wherein the at least oneclose data block comprises at least one data block having a sizerelatively close to the amount of data to be transmitted for eachpriority queue, wherein the criteria further comprises the amount ofdata to be transmitted for each priority queue and the size of the atleast one close data block, wherein the transport block size isdetermined such that the transport block comprises one of: whole datablocks, data blocks having minimal segmentation or a combination ofwhole data blocks and data blocks having minimal segmentation. Infurther embodiments, providing the amount of data to be transmitted foreach priority queue comprises providing a vector comprising a minimumamount of data to be transmitted, wherein the sizes of the close datablocks comprise values relatively close to the minimum amount of data tobe transmitted. In other embodiments, providing the amount of data to betransmitted for each priority queue and the size of the at least oneclose data block comprises using an interface.

In further embodiments, determining the transport block size comprisescalculating an amount of data to be transmitted for each priority queuebased on a scheduling decision. In other embodiments, the amount of datato be transmitted for each priority queue comprises a value relativelyclose to the size of each data block of the plurality of data blocks. Infurther embodiments, determining the transport block size furthercomprises providing a vector of the amount of data to be transmitted foreach priority queue, wherein the vector comprises elements correspondingto each priority queue. In other embodiments, the method is utilized inconjunction with an Evolved Universal Terrestrial Radio Access Network(E-UTRAN) system.

FIG. 13 depicts a flowchart illustrating another non-limiting example ofa method for practicing the exemplary embodiments of this invention. Themethod includes the following steps. In box 151, a data block issegmented into a plurality of segments. Each segment of the plurality ofsegments comprises a data block identifier, a length value and an offsetvalue. The data block identifier comprises an identification of thesegmented data block. The length value comprises a length of thesegment. The offset value comprises a boundary of the segment ascompared to the segmented data block. The segmented data block is to betransported by a plurality of transport blocks. In box 152, a transportblock of the plurality of transport blocks is populated with at leastone segment of the plurality of segments. In box 153, in response toreceiving a retransmission notice indicating a segment of the pluralityof segments, the indicated segment is retransmitted. The retransmissionnotice comprises the data block identifier, the length value and theoffset value of the indicated segment.

In other embodiments, the method further comprises transmitting thepopulated transport block. In further embodiments, the retransmissionnotice comprises an automatic repeat request (ARQ) status report. Inother embodiments, the retransmission notice comprises a negativeacknowledgement (NACK). In further embodiments, retransmitting theindicated segment comprises re-segmenting the indicated segment intosmaller segments and applying at least one of a low order modulation, alow rate channel code and an increased diversity mode.

The exemplary, non-limiting methods shown in FIGS. 12 and 13 anddiscussed with respect thereto may be embodied as a computer programcomprising program instructions embodied on a tangible computer-readablemedium, execution of the program instructions resulting in operationscomprising the steps of the method.

Embodiments of this invention are not limited to the protocol layers L1(PHY) and L2 (MAC), as employed in the examples above. Rather,embodiments of this invention may be implemented for any protocol layersimply for performing segmentation efficiently for scheduling andresource allocation. The scheduler and allocation functions, as relatingto the invention's segmentation process, may be included in differentprotocol layers having a defined interface or, alternatively, they maybe included in the same protocol layer having no such specificinterface. In addition, the scheduler and allocation functions may beincluded in different physical or logical processing units (or partsthereof) or they may be included into the same processing unit.

In one embodiment of this invention, the method described may beimplemented for interfacing MAC segmentation with the scheduling andallocation functions of PHY. Hence, all labels of PHY/MAC/RRC, signalingflows, and primitives are employed as non-limiting examples. As apparentto one skilled in the art, such labels may be replaced by descriptionsof any other relevant functional and/or protocol split. As anon-limiting example, segmentation, scheduling and allocation may takeplace in the same layer.

Although described above with respect to boundaries of SDUs, theexemplary embodiments of the invention may utilize any suitable sizecharacteristic of the SDUs, such as length, as a non-limiting example.Furthermore, although discussed above with respect to an offset from thebeginning of the SDU, the offset value may comprise any suitable valuethat indicates the placement of the segment with respect to the entireSDU. As a non-limiting example, the offset value could indicatere-numbering of segments as described above. As another non-limitingexample, the offset value could indicate the boundary (i.e. end) of thesegment that is nearest to the rear end of the SDU. In addition,although the exemplary embodiments have been discussed with respect toSDUs, the exemplary embodiments may be used in conjunction with thetransport of any suitable collection of data (e.g., a data block).

Based on the foregoing, it should be apparent that the exemplaryembodiments of this invention provide a method, apparatus, and computerprogram product(s) to improve the efficiency of segmentation byproviding an intelligent TB size determination method and a flexiblesegmentation scheme for transmission.

While the exemplary embodiments have been described above in the contextof an E-UTRAN system, it should be appreciated that the exemplaryembodiments of this invention are not limited for use with only this oneparticular type of wireless communication system, and that they may beused to advantage in other wireless communication systems such as 3Ghigh speed packet access (HSPA) evolution, wireless ad hoc networks,cognitive radios, beyond third generation (B3G) systems and fourthgeneration (4G) systems, as non-limiting examples. Such systems areexpected to include techniques that allow for versatile methods of radioadaptation such as bandwidth adaptation, adaptation to spectralconditions, adaptation of radio capacity, adaptation of radio links andadaptation of transmission formats, as non-limiting examples.

In general, the various embodiments may be implemented in hardware orspecial purpose circuits, software, logic or any combination thereof.For example, some aspects may be implemented in hardware, while otheraspects may be implemented in firmware or software which may be executedby a controller, microprocessor or other computing device, although theinvention is not limited thereto. While various aspects of the inventionmay be illustrated and described as block diagrams, flow charts, orusing some other pictorial representation, it is well understood thatthese blocks, apparatus, systems, techniques or methods described hereinmay be implemented in, as non-limiting examples, hardware, software,firmware, special purpose circuits or logic, general purpose hardware orcontroller or other computing devices, or some combination thereof.Embodiments of the inventions may be practiced in various componentssuch as integrated circuit modules. The design of integrated circuits isby and large a highly automated process. Complex and powerful softwaretools are available for converting a logic level design into asemiconductor circuit design ready to be etched and formed on asemiconductor substrate.

Various modifications and adaptations may become apparent to thoseskilled in the relevant arts in view of the foregoing description, whenread in conjunction with the accompanying drawings and the appendedclaims. As but some examples, the use of other similar or equivalentdata flows and transmission procedures may be attempted by those skilledin the art. However, all such and similar modifications of the teachingsof this invention will still fall within the scope of this invention.

Furthermore, some of the features of the examples of this invention maybe used to advantage without the corresponding use of other features. Assuch, the foregoing description should be considered as merelyillustrative of the principles, teachings, examples and exemplaryembodiments of this invention, and not in limitation thereof.

1. A method comprising: determining a size of a transport block based oncriteria comprising a size of at least one data block to be transmitted,wherein the transport block size is determined such that the transportblock will include at least one segment of a data block of the at leastone data block; segmenting the data block of the at least one data blockinto a plurality of segments comprising the at least one segment; andpopulating the transport block with at least the at least one segment.2. The method of claim 1, further comprising: transmitting the populatedtransport block.
 3. The method of claim 1, wherein the criteria furthercomprises multi-user scheduling.
 4. The method of claim 1, wherein thecriteria further comprises logical channel priorities.
 5. The method ofclaim 1, wherein the criteria further comprises at least one of:expected channel conditions of a plurality of radio links, an amount ofdata to be transmitted from each priority queue and a priority value ofeach terminal that is assigned a logical channel.
 6. The method of claim1, wherein each segment of the plurality of segments comprises a datablock identifier, a length value and an offset value, wherein the datablock identifier comprises an identification of the segmented datablock, wherein the length value comprises a length of the segment,wherein the offset value comprises a boundary of the segment as comparedto the segmented data block.
 7. The method of claim 6, furthercomprising: in response to receiving a retransmission notice indicatinga segment of the plurality of segments, retransmitting the segment,wherein the retransmission notice comprises the data block identifier,the length value and the offset value of the indicated segment.
 8. Themethod of claim 7, wherein determining the transport block sizecomprises calculating an amount of data to be transmitted for eachpriority queue based on a scheduling decision, wherein theretransmission notice comprises the amount of data to be transmitted foreach priority queue.
 9. The method of claim 1, wherein determining thetransport block size comprises providing an amount of data to betransmitted for each priority queue and a size of at least one closedata block, wherein the at least one close data block comprises at leastone data block having a size relatively close to the amount of data tobe transmitted for each priority queue, wherein the criteria furthercomprises the amount of data to be transmitted for each priority queueand the size of the at least one close data block, wherein the transportblock size is determined such that the transport block comprises one of:whole data blocks, data blocks having minimal segmentation or acombination of whole data blocks and data blocks having minimalsegmentation.
 10. The method of claim 9, wherein providing the amount ofdata to be transmitted for each priority queue comprises providing avector comprising a minimum amount of data to be transmitted, whereinthe sizes of the close data blocks comprise values relatively close tothe minimum amount of data to be transmitted.
 11. The method of claim 9,wherein providing the amount of data to be transmitted for each priorityqueue and the size of the at least one close data block comprises usingan interface.
 12. The method of claim 1, wherein determining thetransport block size comprises calculating an amount of data to betransmitted for each priority queue based on a scheduling decision. 13.The method of claim 12, wherein the amount of data to be transmitted foreach priority queue comprises a value relatively close to the size ofeach data block of the plurality of data blocks.
 14. The method of claim12, wherein determining the transport block size further comprisesproviding a vector of the amount of data to be transmitted for eachpriority queue, wherein the vector comprises elements corresponding toeach priority queue.
 15. A computer program product comprising programinstructions embodied on a tangible computer-readable medium, executionof the program instructions resulting in operations comprising:determining a size of a transport block based on criteria comprising asize of at least one data block to be transmitted, wherein the transportblock size is determined such that the transport block will include atleast one segment of a data block of the at least one data block;segmenting the data block of the at least one data block into aplurality of segments comprising the at least one segment; andpopulating the transport block with at least the at least one segment.16. The computer program product of claim 15, execution of the programinstructions resulting in operations further comprising: transmittingthe populated transport block.
 17. The computer program product of claim15, wherein each segment of the plurality of segments comprises a datablock identifier, a length value and an offset value, wherein the datablock identifier comprises an identification of the segmented datablock, wherein the length value comprises a length of the segment,wherein the offset value comprises a boundary of the segment as comparedto the segmented data block.
 18. The computer program product of claim15, wherein determining the transport block size comprises providing anamount of data to be transmitted for each priority queue and a size ofat least one close data block, wherein the at least one close data blockcomprises at least one data block having a size relatively close to theamount of data to be transmitted for each priority queue, wherein thecriteria further comprises the amount of data to be transmitted for eachpriority queue and the size of the at least one close data block,wherein the transport block size is determined such that the transportblock comprises one of: whole data blocks, data blocks having minimalsegmentation or a combination of whole data blocks and data blockshaving minimal segmentation.
 19. A method comprising: segmenting a datablock into a plurality of segments, wherein each segment of theplurality of segments comprises a data block identifier, a length valueand an offset value, wherein the data block identifier comprises anidentification of the segmented data block, wherein the length valuecomprises a length of the segment, wherein the offset value comprises aboundary of the segment as compared to the segmented data block, whereinthe segmented data block is to be transported by a plurality oftransport blocks; populating a transport block of the plurality oftransport blocks with at least one segment of the plurality of segments;and in response to receiving a retransmission notice indicating asegment of the plurality of segments, retransmitting the indicatedsegment, wherein the retransmission notice comprises the data blockidentifier, the length value and the offset value of the indicatedsegment.
 20. The method of claim 19, further comprising: transmittingthe populated transport block.
 21. The method of claim 19, wherein theretransmission notice comprises one of an automatic repeat request (ARQ)status report or a negative acknowledgement (NACK).
 22. The method ofclaim 19, wherein retransmitting the indicated segment comprisesre-segmenting the indicated segment into smaller segments and applyingat least one of a low order modulation, a low rate channel code and anincreased diversity mode.
 23. A computer program product comprisingprogram instructions embodied on a tangible computer-readable medium,execution of the program instructions resulting in operationscomprising: segmenting a data block into a plurality of segments,wherein each segment of the plurality of segments comprises a data blockidentifier, a length value and an offset value, wherein the data blockidentifier comprises an identification of the segmented data block,wherein the length value comprises a length of the segment, wherein theoffset value comprises a boundary of the segment as compared to thesegmented data block, wherein the segmented data block is to betransported by a plurality of transport blocks; populating a transportblock of the plurality of transport blocks with at least one segment ofthe plurality of segments; and in response to receiving a retransmissionnotice indicating a segment, retransmitting the indicated segment,wherein the retransmission notice comprises the data block identifier,the length value and the offset value of the indicated segment.
 24. Thecomputer program product of claim 23, execution of the programinstructions resulting in operations further comprising: transmittingthe populated transport block.
 25. The computer program product of claim23, wherein the retransmission notice comprises one of an automaticrepeat request (ARQ) status report or a negative acknowledgement (NACK).26. An electronic device comprising: a memory configured to store atleast one data block to be transmitted by a transport block; and a dataprocessor coupled to the memory, wherein the data processor isconfigured to perform operations comprising: determining a size of thetransport block based on criteria comprising a size of a data block ofthe at least one data block, wherein the transport block size isdetermined such that the transport block will include at least onesegment of the data block; segmenting the data block into a plurality ofsegments comprising the at least one segment; and populating thetransport block with at least the at least one segment.
 27. Theelectronic device of claim 26, further comprising: a transmitter coupledto the data processor, wherein the transmitter is configured to transmitthe transport block.
 28. The electronic device of claim 26, wherein eachsegment of the plurality of segments comprises a data block identifier,a length value and an offset value, wherein the data block identifiercomprises an identification of the segmented data block, wherein thelength value comprises a length of the segment, wherein the offset valuecomprises a boundary of the segment as compared to the segmented datablock.
 29. The electronic device of claim 28, wherein the data processoris further configured to perform the operation of: in response toreceiving a retransmission notice indicating a segment of the pluralityof segments, retransmitting the segment, wherein the retransmissionnotice comprises the data block identifier, the length value and theoffset value of the indicated segment.
 30. The electronic device ofclaim 26, wherein the electronic device comprises an access node of awireless communication network.
 31. An information block to betransmitted from a first node to a second node, the information blockbeing stored on a tangible computer-readable medium prior totransmission, the information block comprising: a portion of a datablock, wherein the portion of the data block does not comprise thecomplete data block; a data block identifier comprising anidentification of the data block; a length value comprising a size ofthe portion of the data block; and an offset value comprising a boundaryof the portion of the data block as compared to the complete data block.32. The information block of claim 31, further comprising: at least oneother complete data block.
 33. An electronic device comprising: a dataprocessor; and a transmitter coupled to the data processor, wherein thetransmitter is configured to transmit a retransmission notice indicatinga segment of a plurality of segments, wherein the retransmission noticecomprises a request for retransmission of the indicated segment, whereinthe plurality of segments comprises a segmented data block, wherein theretransmission notice comprises a data block identifier, a length valueand an offset value of the indicated segment, wherein the data blockidentifier comprises an identification of the segmented data block,wherein the length value comprises a length of the indicated segment,wherein the offset value comprises a boundary of the indicated segmentas compared to the segmented data block.
 34. The electronic device ofclaim 33, further comprising: a receiver coupled to the data processor.35. The electronic device of claim 33, wherein the electronic devicecomprises a mobile terminal.